منابع مشابه
Automata over continuous time
The principal objective of this paper is to lift basic concepts of the classical automata theory from discrete to continuous (real) time. It is argued that the set of nite memory retrospective functions is the set of functions realized by /nite state devices. We show that the /nite memory retrospective functions are speed-independent, i.e., they are invariant under ‘stretchings’ of the time axi...
متن کاملAutomata over Continuous
The principal objective of this paper is to lift basic concepts of the classical automata theory from discrete to continuous (real) time. The shift to continuous time brings to surface phenomena that are invisible at discrete time. A second major task of the paper is to provide a careful analysis of continuous time phenomena that are interesting for their own.
متن کاملUndecidability over Continuous Time
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much greater than that of Turing machines (as other well known models of computation over the real numbers already considered in the past fifteen years, like neural net models with real weights). The fact is that they have n...
متن کاملContinuous Time Paradigms in Logic and Automata
In the last 15 years, research in Computer Science has involved many paradigms in which continuous time appears whether in a pure way or in cooperation with discrete time. In particular, this is evident in subjects concerning Automata and Logic. This issue of FI consists of four papers dedicated to such subjects. The papers will be referred to below as [HR], [S], [PRT], [T] (the initials of the...
متن کاملON SOMEWHAT FUZZY AUTOMATA CONTINUOUS FUNCTIONS IN FUZZY AUTOMATA TOPOLOGICAL SPACES
In this paper, the concepts of somewhat fuzzy automata continuous functions and somewhat fuzzy automata open functions in fuzzy automata topological spaces are introduced and some interesting properties of these functions are studied. In this connection, the concepts of fuzzy automata resolvable spaces and fuzzy automata irresolvable spaces are also introduced and their properties are studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00331-6